/**
*      author: Y_Yao
*      created: 2025-01-18 10:17:30
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 5e5 + 7;
int a[N],f[N];
int n;

void solve()
{
    cin >> n;
    int cnt = 0;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
    }

    for(int i = 1;i <= n;i++)
    {
        f[min(a[i] + (i - 1) + i - cnt,N)]++;
        cnt += f[i];
    }

    for(int i = 1;i <= n;i++)
    {
        f[i] += f[i-1];
    }

    for(int i = 1;i <= n;i++)
    {
        cout << max(0LL,a[i] + i - 1 - f[i-1] - (n - i)) << " ";
    }

}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}